Passing in a Factored OS
نویسنده
چکیده
The fos project aims to build a next generation operating system (OS) for clouds and manycores with hundreds or thousands of cores. The key design tenant of fos is to break operating system services into collections of distributed system processes that communicate with message passing rather than shared memory. This microkernelbased design has the potential for better performance and more efficient use of architectural resources. This is because each isolated address space can be scheduled on a separate dedicated core It is anticipated that assigning entire cores to specific system processes will become feasible in the near future given the trend of increasing abundance of cores per die and in the datacenter. Cache locality in particular benefits from this approach, as user applications no longer compete with the operating system for on-core cache resources. However, for such benefits to be fully realized, the message passing system must be sufficiently low latency. Otherwise, too much time will be spent transfering requests between cores. For this thesis, a high-performance message passing system for fos is developed and evaluated. The system supports a variety of messaging mechanisms, including a kernel messaging transport optimized for one-off communications, a low latency user messaging transport tailored to more frequent communications, and inter-machine messaging over TCP network sockets. Experiments show that the user messaging transport can be used to make core-tocore system calls with comparable latency to the trap-and-enter procedure of conventional system calls in monolithic OSes. Thus the latency of messaging to a different core is sufficiently low to allow for the locality benefits of fos's distributed OS services to overshadow any negative impact of messaging costs. Thesis Supervisor: Anant Agarwal Title: Professor of Electrical Engineering and Computer Science
منابع مشابه
Fleets: Scalable Services in a Factored Operating System
Current monolithic operating systems are designed for uniprocessor systems, and their architecture reflects this. The rise of multicore and cloud computing is drastically changing the tradeoffs in operating system design. The culture of scarce computational resources is being replaced with one of abundant cores, where spatial layout of processes supplants time multiplexing as the primary schedu...
متن کاملA Unified Operating System for Clouds and Manycore: fos
Single chip processors with thousands of cores will be available in the next ten years and clouds of multicore processors afford the operating system designer thousands of cores today. Constructing operating systems for manycore and cloud systems face similar challenges. This work identifies these shared challenges and introduces our solution: a factored operating system (fos) designed to meet ...
متن کاملILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملComplete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملMultiagent Planning with Factored MDPs
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication between the agents is not imposed, but derived directly from the system dynamics and function approximation architecture. We view the entire multiagent system as a single, large Markov decision process (MDP), which we as...
متن کامل